#include<bits/stdc++.h>
using namespace std;
long long n,ans,a[100005];
priority_queue<long long> q;
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for(long long i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    sort(a+1,a+n+1);
    ans=n;
    for(long long i=1;i<=n;i++)
    {
        if(q.size()!=0&&a[i]>(-1)*q.top())
        {
            ans--;
            q.pop();
        }
        q.push((-1)*a[i]);
    }
    cout<<ans;
    return 0;
}
